Fixed-Parameter Tractability of Multicut Parameterized by the Size of the Cutset
نویسندگان
چکیده
منابع مشابه
Fixed-parameter tractability of directed multiway cut parameterized by the size of the cutset
Given a directed graph G, a set of k terminals and an integer p, the Directed Vertex Multiway Cut problem asks if there is a set S of at most p (nonterminal) vertices whose removal disconnects each terminal from all other terminals. Directed Edge Multiway Cut is the analogous problem where S is a set of at most p edges. These two problems indeed are known to be equivalent. A natural generalizat...
متن کاملFixed-Parameter Tractability of Multicut in Directed Acyclic Graphs
The Multicut problem, given a graph G, a set of terminal pairs T = {(si, ti) | 1 ≤ i ≤ r} and an integer p, asks whether one can find a cutset consisting of at most p non-terminal vertices that separates all the terminal pairs, i.e., after removing the cutset, ti is not reachable from si for each 1 ≤ i ≤ r. The fixed-parameter tractability of Multicut in undirected graphs, parameterized by the ...
متن کاملstudy of cohesive devices in the textbook of english for the students of apsychology by rastegarpour
this study investigates the cohesive devices used in the textbook of english for the students of psychology. the research questions and hypotheses in the present study are based on what frequency and distribution of grammatical and lexical cohesive devices are. then, to answer the questions all grammatical and lexical cohesive devices in reading comprehension passages from 6 units of 21units th...
Fixed-parameter tractability and data reduction for multicut in trees
We study an NP-complete (and MaxSNP-hard) communication problem on tree networks, the so-calledMulticut in Trees: given an undirected tree and some pairs of nodes of the tree, find out whether there is a set of at most k tree edges whose removal separates all given pairs of nodes. Multicut has been intensively studied for trees as well as for general graphs mainly from the viewpoint of polynomi...
متن کاملOn the fixed-parameter tractability of parameterized model-checking problems
In this note, we show, through the use of examples, how generic results for proving fixed-parameter tractability which apply to restricted classes of structures can sometimes be more widely applied.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 2014
ISSN: 0097-5397,1095-7111
DOI: 10.1137/110855247